#turing machine

[suaveotter]

Damn Turing was a fucking savage

[eucalyptus-gl0bulus]

turing from 2064 read only memories is an interesting character

they (/them) were the first sapient robot, and is presumably responsible for the lilims in va11-hall A (which makes them the best thing to ever happen to that universe. all hail the dorothinquisition)

they're also partially responsible for a slur being made due to objecting to being called "bucket of bolts" by chad "starfucker" mulberry on account of them not having any nuts or bolts in their composition

the slur created, bit brain isn't used in va11 from what i remember.

[thedetectivethepirate]

He deserved so much better.

[strixton]

i feel tumblr would appreciate my answer to my turing machine homework in computer science

it's a completion grade, so the professor said i could draw garfield and get it right, so i did just that

[ihavemorestuff]

Hear me out, new national holiday idea: Turing day, June 23rd. I find it awesome that one of America's most important gay people has a birthday in pride month. I want to hear about a wave of people performing a Turing test on their local AI language model or something of that ilk on the news for that day. The man saved America and he's only a footnote in most history textbooks.

[alextfish]

I am here to tell you about a silly accomplishment of mine, via the medium of an even sillier song.

(The full video, paper etc are linked from https://www.toothycat.net/~hologram/Magic/ , but I like the silly song best. And it's only 2 minutes long.)

[valepert]

Cathode Ray Dude - Quick Start, Episode 7: Crimes… And Felonies.

CC-BY 4.0

[brigittemarlt]

The man who has broken the code. Alan Turing  is one of Derek’s most memorable portrayal. Emotionally intense. Turing should have been a hero of his time. He was finally a victim of Intolerance. He has contributed to save mankind. And mankind has betrayed him. What Derek did here is more than an artistic performance. It is also a personal tribute to a great man. He has highly contributed by his talent to put Turing’s work and life into light and given him the recognition that he deserved (photo : Martha Swope)

[forgottenbones]

Turing Machines - How Computer Science Was Created By Accident

[geeknik]

The Halting Problem & Quantum Computing

Hey there! So, you've probably heard about quantum computers and how they are these game-changing machines that could potentially solve some of the most complex problems in the blink of an eye. And while that may be true for many problems, there's one problem that even quantum computers can't crack - the infamous halting problem. In this article, we're going to dive into the details of why quantum computers are powerless against this conundrum.

But before we delve into why quantum computers can't solve the halting problem, let's first understand what the halting problem is. In computer science, the halting problem refers to the challenge of determining whether a given computer program will eventually halt (stop running) or loop indefinitely. It was famously proven to be undecidable by the legendary computer scientist Alan Turing back in the 1930s.

Now, let's talk about quantum computers and their unique abilities. Unlike classical computers that use bits to represent information as either a 0 or a 1, quantum computers utilize quantum bits or qubits. These qubits can exist in multiple states simultaneously, thanks to a property called superposition. Additionally, quantum computers harness another property known as entanglement, which allows the state of one qubit to be related to the state of another, no matter the distance between them.

With these extraordinary capabilities, one might think that quantum computers could crack any problem, including the halting problem. However, here's where the limitation lies - the halting problem is fundamentally undecidable, meaning there is no algorithm that can solve it for all possible inputs.

The proof that Turing provided for the halting problem holds true for both classical and quantum computers. It relies on the concept of a "universal Turing machine," which is a theoretical machine capable of simulating any other Turing machine. The proof shows that it is impossible to construct an algorithm that can determine whether an arbitrary program will halt or not.

When it comes to quantum computers, their power lies in their ability to efficiently process certain types of problems, mainly those involving optimization and simulation tasks. They can outperform classical computers in specific domains, such as factorizing large numbers or simulating quantum systems. However, the halting problem is not in the realm of problems well-suited for quantum computing.

The reason why quantum computers fail to tackle the halting problem lies in the undecidability of the problem itself. It transcends the power of both classical and quantum computation. No matter how advanced our technology becomes, we will never be able to develop a general algorithm that can predict the halting behavior of any computer program.

In conclusion, while quantum computers hold immense potential to transform various fields, they are not a magic bullet that can solve all problems, particularly the halting problem. The inherent undecidability of the problem sets a fundamental limitation that no amount of technological advancement can overcome. It's a fascinating reminder of the boundaries that even the most powerful computers face when dealing with the complexities of computation.

So, the next time you hear about the wonders of quantum computing, remember that there are still some puzzles in the computing world that will remain unsolvable, no matter how extraordinary the technology may be.

[ehj3]

MAN UNKIND

 “Man’s being is made of such strange stuff as to be partly akin to nature and partly not, at once natural and extranatural, a kind of ontological centaur, half immersed in nature, half transcending it.” — José Ortega Y Gasset The question was once, “Are we animal or angel?” (or centaur) It was then secularized to ape or automaton. Then Freud answered, “Both!” His Id and Superego being the…

[zelihatrifles]

The Imitation Game

Misunderstood genius is a pretty well-worn trope you may say, but Alan Turing really was exceptional. Benedict Cumberbatch plays him with that precise arrogance of knowing that he is superior to the others, but also with that terrible loneliness that comes from being right all the time, and from a sexual orientation that is so illegal that the government nearly drove him to suicide with the unfair punishment. I should say spoiler alert perhaps, but more than suspense, this information serves to shock us that this pioneer who made modern computers possible was treated with such impunity during his own time. And also, don't stop yourself from feeling miserable about Christopher. So, do go and give it a watch!

[mikethegawd]

back when gay math wasn't just 2 for 1 Espolon shots being basically free (although they obvi ARE)

[getting-out-of-bed-sb]

Engaging my brain for once

[willitcompute]

In a nutshell, a “Turing Machine” is a hypothetical device that starts with a specific input and — given infinite time and scratch paper to do its work — can calculate the answer to specific kinds of questions without any further input. If a process or a device is “Turing Complete,” it’s capable of running arbitrarily complex computer programs — but nobody’s making any promises about efficiency.

[rastronomicals]

5:58 AM EST December 28, 2024:

Turing Machine - "Synchronicity III" From the album Zwei (November 8, 2004)

Last song scrobbled from iTunes at Last.fm

File under: Sequel Songs to those by The Police